The Method of Plurality Generation of Disjoint Paths Using Horizontal Exclusive Scheduling

نویسندگان

  • Y. Kulakov
  • A. Kogan
چکیده

Abstract. The use of the method based on the multipath routing organization for secure routing in mobile networks is quite efficient. In this paper, the method of plurality generation of safest ways is proved, which allows reducing the time complexity of the plurality of the safest ways formation algorithm due to the operations on the set of vertices and their neighborhood.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...

متن کامل

Stochastic Joint Optimal Distributed Generation Scheduling and Distribution Feeder Reconfiguration of Microgrids Considering Uncertainties Modeled by Copula-Based Method

Using distributed generations (DGs) with optimal scheduling and optimal distribution feeder reconfiguration (DFR) are two aspects that can improve efficiency as well as technical and economic features of microgrids (MGs). This work presents a stochastic copula scenario-based framework to jointly carry out optimal scheduling of DGs and DFR. This framework takes into account non-dispatchable and ...

متن کامل

An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...

متن کامل

Entropy generation analysis of MHD forced convective flow through a horizontal porous channel

Entropy generation due to viscous incompressible MHD forced convective dissipative fluid flow through a horizontal channel of finite depth in the existence of an inclined magnetic field and heat source effect has been examined. The governing non-linear partial differential equations for momentum, energy and entropy generation are derived and solved by using the analytical method. In addition; t...

متن کامل

Organizing Multipath Routing in Cloud Computing Environments

One of the objectives of organizing cloud systems is to ensure effective access to remote resources by optimizing traffic engineering (TE) procedures. This paper considers the traffic engineering problem in a cloud environment by using a multipath routing technique. The multipath routing algorithm is used to identify the maximum number of disjoint paths in the graph which overcomes the problem ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014